OPODIS 2020 - Approximating Bipartite Minimum Vertex Cover in the CONGEST model PODC–DISC 22:15 3 years ago 509 Далее Скачать
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets PODC–DISC 24:10 4 years ago 207 Далее Скачать
lecture6 04 alldiff dom consistent consistency check maximum matching Pierre Schaus 9:43 3 years ago 277 Далее Скачать
Lower bounds for maximal matchings and maximal independent sets IEEE FOCS: Foundations of Computer Science 23:59 4 years ago 357 Далее Скачать
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond PODC–DISC 25:50 4 years ago 270 Далее Скачать
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Lower Bounds Simons Institute 46:40 Streamed 1 year ago 536 Далее Скачать
Andrzej Czygrinow: Matchings and their generalizations in certain classes of sparse graphs PODC–DISC 34:06 3 years ago 107 Далее Скачать
WAOA.4.1 Distributed Algorithms for Matching in Hypergraphs Conference ALGO2020 23:34 4 years ago 49 Далее Скачать
Truly Tight-in-$\Delta$ Bounds for Bipartite Maximal Matching and Variants PODC–DISC 25:42 4 years ago 97 Далее Скачать
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs PODC–DISC 19:57 4 years ago 203 Далее Скачать
Can we assign everyone a job? (maximum matchings) | Bipartite Matchings OptWhiz 10:20 2 years ago 9 290 Далее Скачать
Simple, Deterministic, Constant-Round Coloring in the Congested Clique PODC–DISC 24:57 4 years ago 346 Далее Скачать
Soheil Behnezhad - Recent Progress on Sublinear Time Algorithms for Maximum Matching DIMACS CCICADA 50:36 1 year ago 377 Далее Скачать